|
|
Scrabble
Picek, Radomír ; Glembek, Ondřej (referee) ; Smrž, Pavel (advisor)
This thesis describes the social table game Scrabble, and its realization in the form of computer games. Gradually examines all important aspects that affect the performance of the implementation. Especially after the election of the appropriate data structures retained for the vocabulary, affecting the efficiency of generating moves, and the selection of appropriate algorithms with regard to the maximum speed. There is particular emphasis on artificial intelligence opponent and its ability to compete not only amateurs, but professional SCRABBLE players.
|
|
|
Scrabble for Mobil Phones
Kaněčka, Ondřej ; Kunc, Michael (referee) ; Schönecker, Rudolf (advisor)
This paper deals with an usage of searching algorithms and lexical data structures for platforms with limited computing power and accessible memory (celluar phones and similar) in SCRABBLE brand crossword game. There are also shown its advantages and disadvantages on this platform. The Appel-Jacobson searching algorithm is used to search possible moves. The lexicon with all words is available for this algorithm. It's stored in Directed Acyclic Word Graph (DAWG), which provides fast data searching and data compression too, so the size of the lexicon is comparatively small considering the target platform. The final Java application for celluar phones (MIDP 2.0) adds graphical interface and game control so it provides playing SCRABBLE brand crossword game against artificial intelligence or against human.
|
|
|
Trie Structures for Large Text Data Processing
Rajčok, Andrej ; Otrusina, Lubomír (referee) ; Smrž, Pavel (advisor)
This study analyzes natural language processing with emphasis on morphological analysis of inflective languages and systems for named entity recognition. It analyzes effective pattern matching in dictionary by using succint structures and then analyzes practical implementation of succint structures. It describes design and implementation of named entity recognition system and morphological analyzer and compares and test their speed and effectiveness.
|
|
|
Suffix Graphs and Lossless Data Compression
Senft, Martin ; Dvořák, Tomáš (advisor) ; Dvorský, Jiří (referee) ; Smyth, William F. (referee)
Title: Suffix Graphs and Lossless Data Compression Author: Martin Senft Department: Department of Software and Computer Science Education Supervisor of the doctoral thesis: doc. RNDr. Tomáš Dvorˇák, CSc., Depart- ment of Software and Computer Science Education Abstract: Suffix tree and its variants are widely studied data structures that enable an efficient solution to a number of string problems, but also serve for implementation of data compression algorithms. This work explores the opposite approach: design of compression methods, based entirely on prop- erties of suffix graphs. We describe a unified construction algorithm for suf- fix trie, suffix tree, DAWG and CDAWG, accompanied by analysis of implicit suffix link simulation that yields two practical alternatives. Since the com- pression applications require maintaining text in the sliding window, an in- depth discussionof slidingsuffixgraphsisneeded. Fillinggapsin previously published proofs, we verify that suffix tree is capable of perfect sliding in amortised constant time. On the other hand, we show that this is not the case with CDAWG, thus resolving a problem of Inenaga et al. Building on these investigations,we describea family of data compression methods,based on a description of suffix tree construction for the string to be compressed. While some of...
|
|
|
Trie Structures for Large Text Data Processing
Rajčok, Andrej ; Otrusina, Lubomír (referee) ; Smrž, Pavel (advisor)
This study analyzes natural language processing with emphasis on morphological analysis of inflective languages and systems for named entity recognition. It analyzes effective pattern matching in dictionary by using succint structures and then analyzes practical implementation of succint structures. It describes design and implementation of named entity recognition system and morphological analyzer and compares and test their speed and effectiveness.
|
|
|
Scrabble for Mobil Phones
Kaněčka, Ondřej ; Kunc, Michael (referee) ; Schönecker, Rudolf (advisor)
This paper deals with an usage of searching algorithms and lexical data structures for platforms with limited computing power and accessible memory (celluar phones and similar) in SCRABBLE brand crossword game. There are also shown its advantages and disadvantages on this platform. The Appel-Jacobson searching algorithm is used to search possible moves. The lexicon with all words is available for this algorithm. It's stored in Directed Acyclic Word Graph (DAWG), which provides fast data searching and data compression too, so the size of the lexicon is comparatively small considering the target platform. The final Java application for celluar phones (MIDP 2.0) adds graphical interface and game control so it provides playing SCRABBLE brand crossword game against artificial intelligence or against human.
|
|
|
Scrabble
Picek, Radomír ; Glembek, Ondřej (referee) ; Smrž, Pavel (advisor)
This thesis describes the social table game Scrabble, and its realization in the form of computer games. Gradually examines all important aspects that affect the performance of the implementation. Especially after the election of the appropriate data structures retained for the vocabulary, affecting the efficiency of generating moves, and the selection of appropriate algorithms with regard to the maximum speed. There is particular emphasis on artificial intelligence opponent and its ability to compete not only amateurs, but professional SCRABBLE players.
|
guest ::
